Finding network communities using modularity density
نویسندگان
چکیده
منابع مشابه
Finding network communities using modularity density
Many real-world complex networks exhibit a community structure, in which the modules correspond to actual functional units. Identifying these communities is a key challenge for scientists. A common approach is to search for the network partition that maximizes a quality function. Here, we present a detailed analysis of a recently proposed function, namely modularity density. We show that it doe...
متن کاملNetwork community detection using modularity density measures
Modularity, since its introduction, has remained one of the most widely used metrics to assess the quality of community structure in a complex network. However the resolution limit problem associated with modularity limits its applicability to networks with community sizes smaller than a certain scale. In the past various attempts have been made to solve this problem. More recently a new metric...
متن کاملFinding Inner Copy Communities Using Social Network Analysis
Nowadays, the technology usage is a massive practice where internet and digital documents are considered as powerful tools in both professional and personal domains. Although, as useful as they can be in a proper way, wrong practices can appear easily, where the copy & paste or plagiarism phenomenon is not far away from this. Documents’ copy & paste is a world-wide growing practice, and Chile i...
متن کاملUsing Stable Communities for Maximizing Modularity
Modularity maximization is an important problem in network analysis and is used for detecting communities in networks. However, like many other NP-hard combinatorial optimization problems, the results–the value of the modularity as well as the community membership– are affected by the order in which the vertices in the network are processed. We define stable communities as groups of vertices th...
متن کاملDetecting hierarchical and overlapping network communities using locally optimal modularity changes
Agglomerative clustering is a well established strategy for identifying communities in networks. Communities are successively merged into larger communities, coarsening a network of actors into a more manageable network of communities. The order in which merges should occur is not in general clear, necessitating heuristics for selecting pairs of communities to merge. We describe a hierarchical ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Statistical Mechanics: Theory and Experiment
سال: 2016
ISSN: 1742-5468
DOI: 10.1088/1742-5468/2016/12/123402